Computability and Non-computability Issues in Amorphous Computing
نویسنده
چکیده
Amorphous computing systems consist of a huge set of tiny simple stationary or mobile processors whose computational, communication and sensory part is reduced to an absolute minimum. In an airborne medium the processors communicate via a short-range radio while in a waterborne medium via molecular communication. In some cases the computational part of the processors can be simplified down to finite state automata or even combinatorial circuits and the system as a whole can still possess universal computational power with a high probability. We will argue that the amorphous systems belong among the simplest (non-uniform) universal computational devices. On the other hand, it is questionable as to what extent the standard universal models of computation can faithfully capture the behavior of amorphous computing systems whose functionality also depends on the non-computational and/or unpredictable operations of certain parts of the entire system.
منابع مشابه
A Theory of Stream Queries
Data streams are modeled as infinite or finite sequences of data elements coming from an arbitrary but fixed universe. The universe can have various built-in functions and predicates. Stream queries are modeled as functions from streams to streams. Both timed and untimed settings are considered. Issues investigated include abstract definitions of computability of stream queries; the connection ...
متن کاملParallel Feedback Turing Computability
In contrast to most kinds of computability studied in mathematical logic, feedback computability has a non-degenerate notion of parallelism. Here we study parallelism for the most basic kind of feedback, namely that of Turing computability. We investigate several different possible definitions of parallelism in this context, with an eye toward specifying what is so computable. For the determini...
متن کاملThe Interplay Between Computability and Incomputability Draft 619.tex
1 Calculus, Continuity, and Computability 3 1.1 When to Introduce Relative Computability? . . . . . . . . . . 4 1.2 Between Computability and Relative Computability? . . . . . 5 1.3 The Development of Relative Computability . . . . . . . . . . 5 1.4 Turing Introduces Relative Computability . . . . . . . . . . . 6 1.5 Post Develops Relative Computability . . . . . . . . . . . . . 6 1.6 Relative ...
متن کاملCan new physics challenge “old” computational barriers?
We discuss the impact of very recent developments of spacetime theory, black hole physics, and cosmology to well established foundational issues of computability theory and logic. Namely, we describe a physical device in relativistic spacetime which can compute a non-Turing computable task, e.g. which can decide the halting problem of Turing machines or whether ZF set theory is consistent or no...
متن کاملON GENERALIZED FUZZY MULTISETS AND THEIR USE IN COMPUTATION
An orthogonal approach to the fuzzification of both multisets and hybridsets is presented. In particular, we introduce $L$-multi-fuzzy and$L$-fuzzy hybrid sets, which are general enough and in spirit with thebasic concepts of fuzzy set theory. In addition, we study the properties ofthese structures. Also, the usefulness of these structures is examined inthe framework of mechanical multiset proc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012